Computer and Modernization ›› 2011, Vol. 193 ›› Issue (9): 5-7,11.doi: 10.3969/j.issn.1006-2475.2011.09.002

• 算法设计与分析 • Previous Articles     Next Articles

Application of Improved PSO in TSP

MA Xiao-hui1, WANG Hong 1,2   

  1. 1.School of Information Science and Engineering, Shandong Normal University, Jinan 250014, China; 2.Shandong Provincial Key Laboratory for Distributed Computer Software New Technology, Jinan 250014, China
  • Received:2011-04-21 Revised:1900-01-01 Online:2011-09-22 Published:2011-09-22

Abstract: The particle swarm optimization algorithm is proposed by Eberhart and Kennedy, thoughts of the algorithm is simple and easy to achieve by programming, so it attracts many scholars’ attention in related areas. The traveling salesman problem as an example, a discrete particle swarm optimization is proposed. The particle’s position, velocity and the operation rules are defined again. Velocity is added the shrinkage factor in the iteration process. The results show that the algorithm is of better performance.

Key words: particle swarm algorithm, discrete particle swarm, combinatorial optimization, traveling salesman problem

CLC Number: